Self-testing of Quantum Circuits
Identifieur interne : 000038 ( France/Analysis ); précédent : 000037; suivant : 000039Self-testing of Quantum Circuits
Auteurs : Frédéric Magniez [France] ; Dominic Mayers [États-Unis] ; Michele Mosca [Canada] ; Harold Ollivier [Canada]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2006.
Abstract
Abstract: We prove that a quantum circuit together with measurement apparatuses and EPR sources can be self-tested, i.e. fully verified without any reference to some trusted set of quantum devices. To achieve our goal we define the notions of simulation and equivalence. Using these two concepts, we construct sets of simulation conditions which imply that the physical device of interest is equivalent to the one it is supposed to implement. Another benefit of our formalism is that our statements can be proved to be robust. Finally, we design a test for quantum circuits whose complexity is polynomial in the number of gates and qubits, and the required precision.
Url:
DOI: 10.1007/11786986_8
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Main, to step Corpus: 000536
- to stream Main, to step Curation: 000536
- to stream Main, to step Exploration: 000245
- to stream France, to step Extraction: 000038
Links to Exploration step
ISTEX:32E0C13F2451B899D2A38639C274F16F8CE9EBE9Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Self-testing of Quantum Circuits</title><author><name sortKey="Magniez, Frederic" sort="Magniez, Frederic" uniqKey="Magniez F" first="Frédéric" last="Magniez">Frédéric Magniez</name></author><author><name sortKey="Mayers, Dominic" sort="Mayers, Dominic" uniqKey="Mayers D" first="Dominic" last="Mayers">Dominic Mayers</name></author><author><name sortKey="Mosca, Michele" sort="Mosca, Michele" uniqKey="Mosca M" first="Michele" last="Mosca">Michele Mosca</name></author><author><name sortKey="Ollivier, Harold" sort="Ollivier, Harold" uniqKey="Ollivier H" first="Harold" last="Ollivier">Harold Ollivier</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:32E0C13F2451B899D2A38639C274F16F8CE9EBE9</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/11786986_8</idno><idno type="url">https://api.istex.fr/document/32E0C13F2451B899D2A38639C274F16F8CE9EBE9/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">000536</idno><idno type="wicri:Area/Main/Curation">000536</idno><idno type="wicri:Area/Main/Exploration">000245</idno><idno type="wicri:explorRef" wicri:stream="Main" wicri:step="Exploration">000245</idno><idno type="wicri:Area/France/Extraction">000038</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Self-testing of Quantum Circuits</title><author><name sortKey="Magniez, Frederic" sort="Magniez, Frederic" uniqKey="Magniez F" first="Frédéric" last="Magniez">Frédéric Magniez</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>CNRS–LRI, University Paris-Sud</wicri:regionArea><wicri:noRegion>University Paris-Sud</wicri:noRegion><wicri:noRegion>University Paris-Sud</wicri:noRegion></affiliation></author><author><name sortKey="Mayers, Dominic" sort="Mayers, Dominic" uniqKey="Mayers D" first="Dominic" last="Mayers">Dominic Mayers</name><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Institute for Quantum Information, Caltech</wicri:regionArea><wicri:noRegion>Caltech</wicri:noRegion></affiliation></author><author><name sortKey="Mosca, Michele" sort="Mosca, Michele" uniqKey="Mosca M" first="Michele" last="Mosca">Michele Mosca</name><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Institute for Quantum Computing, University of Waterloo</wicri:regionArea><wicri:noRegion>University of Waterloo</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Perimeter Institute for Theoretical Physics, Waterloo</wicri:regionArea><wicri:noRegion>Waterloo</wicri:noRegion></affiliation></author><author><name sortKey="Ollivier, Harold" sort="Ollivier, Harold" uniqKey="Ollivier H" first="Harold" last="Ollivier">Harold Ollivier</name><affiliation wicri:level="1"><country xml:lang="fr">Canada</country><wicri:regionArea>Perimeter Institute for Theoretical Physics, Waterloo</wicri:regionArea><wicri:noRegion>Waterloo</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2006</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">32E0C13F2451B899D2A38639C274F16F8CE9EBE9</idno><idno type="DOI">10.1007/11786986_8</idno><idno type="ChapterID">8</idno><idno type="ChapterID">Chap8</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We prove that a quantum circuit together with measurement apparatuses and EPR sources can be self-tested, i.e. fully verified without any reference to some trusted set of quantum devices. To achieve our goal we define the notions of simulation and equivalence. Using these two concepts, we construct sets of simulation conditions which imply that the physical device of interest is equivalent to the one it is supposed to implement. Another benefit of our formalism is that our statements can be proved to be robust. Finally, we design a test for quantum circuits whose complexity is polynomial in the number of gates and qubits, and the required precision.</div></front></TEI><affiliations><list><country><li>Canada</li><li>France</li><li>États-Unis</li></country></list><tree><country name="France"><noRegion><name sortKey="Magniez, Frederic" sort="Magniez, Frederic" uniqKey="Magniez F" first="Frédéric" last="Magniez">Frédéric Magniez</name></noRegion></country><country name="États-Unis"><noRegion><name sortKey="Mayers, Dominic" sort="Mayers, Dominic" uniqKey="Mayers D" first="Dominic" last="Mayers">Dominic Mayers</name></noRegion></country><country name="Canada"><noRegion><name sortKey="Mosca, Michele" sort="Mosca, Michele" uniqKey="Mosca M" first="Michele" last="Mosca">Michele Mosca</name></noRegion><name sortKey="Mosca, Michele" sort="Mosca, Michele" uniqKey="Mosca M" first="Michele" last="Mosca">Michele Mosca</name><name sortKey="Ollivier, Harold" sort="Ollivier, Harold" uniqKey="Ollivier H" first="Harold" last="Ollivier">Harold Ollivier</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Amerique/explor/CaltechV1/Data/France/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000038 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/France/Analysis/biblio.hfd -nk 000038 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Amerique
|area= CaltechV1
|flux= France
|étape= Analysis
|type= RBID
|clé= ISTEX:32E0C13F2451B899D2A38639C274F16F8CE9EBE9
|texte= Self-testing of Quantum Circuits
}}
| This area was generated with Dilib version V0.6.32. |  |